Providing dispersed storage network location information of a hypertext markup language file

ABSTRACT

A method begins by a dispersed storage (DS) processing module of a domain name system (DNS) server receiving, from a client, a request regarding dispersed storage network (DSN) location information of a hypertext markup language (HTML) file. The method continues with the DS processing module searching a DNS table for an entry regarding the HTML file based on information of the request. When the entry is found, the method continues with the DS processing module ascertaining the DSN location information regarding a plurality of sets of encoded data slices, wherein the HTML file is encoded using a DS error coding function to produce the plurality of sets of encoded data slices and wherein the plurality of sets of encoded data slices is stored in a DSN. The method continues with the DS processing module outputting the DSN location information to the client.

CROSS REFERENCE TO RELATED PATENTS

The present U.S. Utility patent application claims priority pursuant to35 U.S.C. §119(e) to U.S. Provisional Application No. 61/483,856,entitled “Content Distribution Network Utilizing a Dispersed StorageNetwork,” filed May 9, 2011, pending, which is incorporated herein byreference in its entirety and made part of the present U.S. Utilitypatent application for all purposes.

CROSS REFERENCE TO RELATED PATENTS

Not Applicable

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not Applicable

BACKGROUND OF THE INVENTION

1. Technical Field of the Invention

This invention relates generally to computing systems and moreparticularly to data storage solutions within such computing systems.

2. Description of Related Art

Computers are known to communicate, process, and store data. Suchcomputers range from wireless smart phones to data centers that supportmillions of web searches, stock trades, or on-line purchases every day.In general, a computing system generates data and/or manipulates datafrom one form into another. For instance, an image sensor of thecomputing system generates raw picture data and, using an imagecompression program (e.g., JPEG, MPEG, etc.), the computing systemmanipulates the raw picture data into a standardized compressed image.

With continued advances in processing speed and communication speed,computers are capable of processing real time multimedia data forapplications ranging from simple voice communications to streaming highdefinition video. As such, general-purpose information appliances arereplacing purpose-built communications devices (e.g., a telephone). Forexample, smart phones can support telephony communications but they arealso capable of text messaging and accessing the internet to performfunctions including email, web browsing, remote applications access, andmedia communications (e.g., telephony voice, image transfer, musicfiles, video files, real time video streaming. etc.).

Each type of computer is constructed and operates in accordance with oneor more communication, processing, and storage standards. As a result ofstandardization and with advances in technology, more and moreinformation content is being converted into digital formats. Forexample, more digital cameras are now being sold than film cameras, thusproducing more digital pictures. As another example, web-basedprogramming is becoming an alternative to over the air televisionbroadcasts and/or cable broadcasts. As further examples, papers, books,video entertainment, home video, etc. are now being stored digitally,which increases the demand on the storage function of computers.

A typical computer storage system includes one or more memory devicesaligned with the needs of the various operational aspects of thecomputer's processing and communication functions. Generally, theimmediacy of access dictates what type of memory device is used. Forexample, random access memory (RAM) memory can be accessed in any randomorder with a constant response time, thus it is typically used for cachememory and main memory. By contrast, memory device technologies thatrequire physical movement such as magnetic disks, tapes, and opticaldiscs, have a variable response time as the physical movement can takelonger than the data transfer, thus they are typically used forsecondary memory (e.g., hard drive, backup memory, etc.).

A computer's storage system will be compliant with one or more computerstorage standards that include, but are not limited to, network filesystem (NFS), flash file system (FFS), disk file system (DFS), smallcomputer system interface (SCSI), internet small computer systeminterface (iSCSI), file transfer protocol (FTP), and web-baseddistributed authoring and versioning (WebDAV). These standards specifythe data storage format (e.g., files, data objects, data blocks,directories, etc.) and interfacing between the computer's processingfunction and its storage system, which is a primary function of thecomputer's memory controller.

Despite the standardization of the computer and its storage system,memory devices fail; especially commercial grade memory devices thatutilize technologies incorporating physical movement (e.g., a discdrive). For example, it is fairly common for a disc drive to routinelysuffer from bit level corruption and to completely fail after threeyears of use. One solution is to a higher-grade disc drive, which addssignificant cost to a computer.

Another solution is to utilize multiple levels of redundant disc drivesto replicate the data into two or more copies. One such redundant driveapproach is called redundant array of independent discs (RAID). In aRAID device, a RAID controller adds parity data to the original databefore storing it across the array. The parity data is calculated fromthe original data such that the failure of a disc will not result in theloss of the original data. For example, RAID 5 uses three discs toprotect data from the failure of a single disc. The parity data, andassociated redundancy overhead data, reduces the storage capacity ofthree independent discs by one third (e.g., n−1=capacity). RAID 6 canrecover from a loss of two discs and requires a minimum of four discswith a storage capacity of n−2.

While RAID addresses the memory device failure issue, it is not withoutits own failures issues that affect its effectiveness, efficiency andsecurity. For instance, as more discs are added to the array, theprobability of a disc failure increases, which increases the demand formaintenance. For example, when a disc fails, it needs to be manuallyreplaced before another disc fails and the data stored in the RAIDdevice is lost. To reduce the risk of data loss, data on a RAID deviceis typically copied on to one or more other RAID devices. While thisaddresses the loss of data issue, it raises a security issue sincemultiple copies of data are available, which increases the chances ofunauthorized access. Further, as the amount of data being stored grows,the overhead of RAID devices becomes a non-trivial efficiency issue.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a computingsystem in accordance with the present invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the present invention;

FIG. 3 is a schematic block diagram of an embodiment of a distributedstorage processing unit in accordance with the present invention;

FIG. 4 is a schematic block diagram of an embodiment of a grid module inaccordance with the present invention;

FIG. 5 is a diagram of an example embodiment of error coded data slicecreation in accordance with the present invention;

FIG. 6A is a diagram illustrating an example of a linked directory filestructure in accordance with the present invention;

FIG. 6B is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 6C is a flowchart illustrating an example of accessing a data filein accordance with the present invention;

FIG. 7A is a diagram illustrating an example of a directory filestructure in accordance with the present invention;

FIG. 7B is a flowchart illustrating another example of accessing a datafile in accordance with the present invention;

FIG. 8A is a diagram illustrating an example of a web page filestructure in accordance with the present invention;

FIG. 8B is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 8C is a flowchart illustrating an example of accessing a secondaryweb page file in accordance with the present invention;

FIG. 9A is a diagram illustrating an example of a domain name system(DNS) file structure in accordance with the present invention;

FIG. 9B is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention;

FIG. 9C is a flowchart illustrating an example of providing dispersedstorage network location information in accordance with the presentinvention;

FIG. 10 is a flowchart illustrating an example of generating an auditobject in accordance with the present invention;

FIG. 11A is a diagram illustrating an example of an audit object filestructure in accordance with the present invention;

FIG. 11B is a diagram illustrating an example of an audit record filestructure in accordance with the present invention;

FIG. 11C is a diagram illustrating an example of integrity informationstructure in accordance with the present invention;

FIG. 12A is a schematic block diagram of another embodiment of acomputing system in accordance with the present invention; and

FIG. 12B is a flowchart illustrating an example of storing a binarylarge object (blob) in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of a computing system 10 thatincludes one or more of a first type of user devices 12, one or more ofa second type of user devices 14, at least one distributed storage (DS)processing unit 16, at least one DS managing unit 18, at least onestorage integrity processing unit 20, and a distributed storage network(DSN) memory 22 coupled via a network 24. The network 24 may include oneor more wireless and/or wire lined communication systems; one or moreprivate intranet systems and/or public internet systems; and/or one ormore local area networks (LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of distributed storage (DS) units36 for storing data of the system. Each of the DS units 36 includes aprocessing module and memory and may be located at a geographicallydifferent site than the other DS units (e.g., one in Chicago, one inMilwaukee, etc.).

Each of the user devices 12-14, the DS processing unit 16, the DSmanaging unit 18, and the storage integrity processing unit 20 may be aportable computing device (e.g., a social networking device, a gamingdevice, a cell phone, a smart phone, a personal digital assistant, adigital music player, a digital video player, a laptop computer, ahandheld computer, a video game controller, and/or any other portabledevice that includes a computing core) and/or a fixed computing device(e.g., a personal computer, a computer server, a cable set-top box, asatellite receiver, a television set, a printer, a fax machine, homeentertainment equipment, a video game console, and/or any type of homeor office computing equipment). Such a portable or fixed computingdevice includes a computing core 26 and one or more interfaces 30, 32,and/or 33. An embodiment of the computing core 26 will be described withreference to FIG. 2.

With respect to the interfaces, each of the interfaces 30, 32, and 33includes software and/or hardware to support one or more communicationlinks via the network 24 indirectly and/or directly. For example,interfaces 30 support a communication link (wired, wireless, direct, viaa LAN, via the network 24, etc.) between the first type of user device14 and the DS processing unit 16. As another example, DSN interface 32supports a plurality of communication links via the network 24 betweenthe DSN memory 22 and the DS processing unit 16, the first type of userdevice 12, and/or the storage integrity processing unit 20. As yetanother example, interface 33 supports a communication link between theDS managing unit 18 and any one of the other devices and/or units 12,14, 16, 20, and/or 22 via the network 24.

In general and with respect to data storage, the system 10 supportsthree primary functions: distributed network data storage management,distributed data storage and retrieval, and data storage integrityverification. In accordance with these three primary functions, data canbe distributedly stored in a plurality of physically different locationsand subsequently retrieved in a reliable and secure manner regardless offailures of individual storage devices, failures of network equipment,the duration of storage, the amount of data being stored, attempts athacking the data, etc.

The DS managing unit 18 performs distributed network data storagemanagement functions, which include establishing distributed datastorage parameters, performing network operations, performing networkadministration, and/or performing network maintenance. The DS managingunit 18 establishes the distributed data storage parameters (e.g.,allocation of virtual DSN memory space, distributed storage parameters,security parameters, billing information, user profile information,etc.) for one or more of the user devices 12-14 (e.g., established forindividual devices, established for a user group of devices, establishedfor public access by the user devices, etc.). For example, the DSmanaging unit 18 coordinates the creation of a vault (e.g., a virtualmemory block) within the DSN memory 22 for a user device (for a group ofdevices, or for public access). The DS managing unit 18 also determinesthe distributed data storage parameters for the vault. In particular,the DS managing unit 18 determines a number of slices (e.g., the numberthat a data segment of a data file and/or data block is partitioned intofor distributed storage) and a read threshold value (e.g., the minimumnumber of slices required to reconstruct the data segment).

As another example, the DS managing module 18 creates and stores,locally or within the DSN memory 22, user profile information. The userprofile information includes one or more of authentication information,permissions, and/or the security parameters. The security parameters mayinclude one or more of encryption/decryption scheme, one or moreencryption keys, key generation scheme, and data encoding/decodingscheme.

As yet another example, the DS managing unit 18 creates billinginformation for a particular user, user group, vault access, publicvault access, etc. For instance, the DS managing unit 18 tracks thenumber of times user accesses a private vault and/or public vaults,which can be used to generate a per-access bill. In another instance,the DS managing unit 18 tracks the amount of data stored and/orretrieved by a user device and/or a user group, which can be used togenerate a per-data-amount bill.

The DS managing unit 18 also performs network operations, networkadministration, and/or network maintenance. As at least part ofperforming the network operations and/or administration, the DS managingunit 18 monitors performance of the devices and/or units of the system10 for potential failures, determines the devices and/or unit'sactivation status, determines the devices' and/or units' loading, andany other system level operation that affects the performance level ofthe system 10. For example, the DS managing unit 18 receives andaggregates network management alarms, alerts, errors, statusinformation, performance information, and messages from the devices12-14 and/or the units 16, 20, 22. For example, the DS managing unit 18receives a simple network management protocol (SNMP) message regardingthe status of the DS processing unit 16.

The DS managing unit 18 performs the network maintenance by identifyingequipment within the system 10 that needs replacing, upgrading,repairing, and/or expanding. For example, the DS managing unit 18determines that the DSN memory 22 needs more DS units 36 or that one ormore of the DS units 36 needs updating.

The second primary function (i.e., distributed data storage andretrieval) begins and ends with a user device 12-14. For instance, if asecond type of user device 14 has a data file 38 and/or data block 40 tostore in the DSN memory 22, it send the data file 38 and/or data block40 to the DS processing unit 16 via its interface 30. As will bedescribed in greater detail with reference to FIG. 2, the interface 30functions to mimic a conventional operating system (OS) file systeminterface (e.g., network file system (NFS), flash file system (FFS),disk file system (DFS), file transfer protocol (FTP), web-baseddistributed authoring and versioning (WebDAV), etc.) and/or a blockmemory interface (e.g., small computer system interface (SCSI), internetsmall computer system interface (iSCSI), etc.). In addition, theinterface 30 may attach a user identification code (ID) to the data file38 and/or data block 40.

The DS processing unit 16 receives the data file 38 and/or data block 40via its interface 30 and performs a distributed storage (DS) process 34thereon (e.g., an error coding dispersal storage function). The DSprocessing 34 begins by partitioning the data file 38 and/or data block40 into one or more data segments, which is represented as Y datasegments. For example, the DS processing 34 may partition the data file38 and/or data block 40 into a fixed byte size segment (e.g., 2¹ to2^(n) bytes, where n=>2) or a variable byte size (e.g., change byte sizefrom segment to segment, or from groups of segments to groups ofsegments, etc.).

For each of the Y data segments, the DS processing 34 error encodes(e.g., forward error correction (FEC), information dispersal algorithm,or error correction coding) and slices (or slices then error encodes)the data segment into a plurality of error coded (EC) data slices 42-48,which is represented as X slices per data segment. The number of slices(X) per segment, which corresponds to a number of pillars n, is set inaccordance with the distributed data storage parameters and the errorcoding scheme. For example, if a Reed-Solomon (or other FEC scheme) isused in an n/k system, then a data segment is divided into n slices,where k number of slices is needed to reconstruct the original data(i.e., k is the threshold). As a few specific examples, the n/k factormay be 5/3; 6/4; 8/6; 8/5; 16/10.

For each slice 42-48, the DS processing unit 16 creates a unique slicename and appends it to the corresponding slice 42-48. The slice nameincludes universal DSN memory addressing routing information (e.g.,virtual memory addresses in the DSN memory 22) and user-specificinformation (e.g., user ID, file name, data block identifier, etc.).

The DS processing unit 16 transmits the plurality of EC slices 42-48 toa plurality of DS units 36 of the DSN memory 22 via the DSN interface 32and the network 24. The DSN interface 32 formats each of the slices fortransmission via the network 24. For example, the DSN interface 32 mayutilize an internet protocol (e.g., TCP/IP, etc.) to packetize theslices 42-48 for transmission via the network 24.

The number of DS units 36 receiving the slices 42-48 is dependent on thedistributed data storage parameters established by the DS managing unit18. For example, the DS managing unit 18 may indicate that each slice isto be stored in a different DS unit 36. As another example, the DSmanaging unit 18 may indicate that like slice numbers of different datasegments are to be stored in the same DS unit 36. For example, the firstslice of each of the data segments is to be stored in a first DS unit36, the second slice of each of the data segments is to be stored in asecond DS unit 36, etc. In this manner, the data is encoded anddistributedly stored at physically diverse locations to improved datastorage integrity and security.

Each DS unit 36 that receives a slice 42-48 for storage translates thevirtual DSN memory address of the slice into a local physical addressfor storage. Accordingly, each DS unit 36 maintains a virtual tophysical memory mapping to assist in the storage and retrieval of data.

The first type of user device 12 performs a similar function to storedata in the DSN memory 22 with the exception that it includes the DSprocessing. As such, the device 12 encodes and slices the data fileand/or data block it has to store. The device then transmits the slices11 to the DSN memory via its DSN interface 32 and the network 24.

For a second type of user device 14 to retrieve a data file or datablock from memory, it issues a read command via its interface 30 to theDS processing unit 16. The DS processing unit 16 performs the DSprocessing 34 to identify the DS units 36 storing the slices of the datafile and/or data block based on the read command. The DS processing unit16 may also communicate with the DS managing unit 18 to verify that theuser device 14 is authorized to access the requested data.

Assuming that the user device is authorized to access the requesteddata, the DS processing unit 16 issues slice read commands to at least athreshold number of the DS units 36 storing the requested data (e.g., toat least 10 DS units for a 16/10 error coding scheme). Each of the DSunits 36 receiving the slice read command, verifies the command,accesses its virtual to physical memory mapping, retrieves the requestedslice, or slices, and transmits it to the DS processing unit 16.

Once the DS processing unit 16 has received a read threshold number ofslices for a data segment, it performs an error decoding function andde-slicing to reconstruct the data segment. When Y number of datasegments has been reconstructed, the DS processing unit 16 provides thedata file 38 and/or data block 40 to the user device 14. Note that thefirst type of user device 12 performs a similar process to retrieve adata file and/or data block.

The storage integrity processing unit 20 performs the third primaryfunction of data storage integrity verification. In general, the storageintegrity processing unit 20 periodically retrieves slices 45, and/orslice names, of a data file or data block of a user device to verifythat one or more slices have not been corrupted or lost (e.g., the DSunit failed). The retrieval process mimics the read process previouslydescribed.

If the storage integrity processing unit 20 determines that one or moreslices is corrupted or lost, it rebuilds the corrupted or lost slice(s)in accordance with the error coding scheme. The storage integrityprocessing unit 20 stores the rebuild slice, or slices, in theappropriate DS unit(s) 36 in a manner that mimics the write processpreviously described.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (IO)controller 56, a peripheral component interconnect (PCI) interface 58,at least one IO device interface module 62, a read only memory (ROM)basic input output system (BIOS) 64, and one or more memory interfacemodules. The memory interface module(s) includes one or more of auniversal serial bus (USB) interface module 66, a host bus adapter (HBA)interface module 68, a network interface module 70, a flash interfacemodule 72, a hard drive interface module 74, and a DSN interface module76. Note the DSN interface module 76 and/or the network interface module70 may function as the interface 30 of the user device 14 of FIG. 1.Further note that the IO device interface module 62 and/or the memoryinterface modules may be collectively or individually referred to as IOports.

FIG. 3 is a schematic block diagram of an embodiment of a dispersedstorage (DS) processing module 34 of user device 12 and/or of the DSprocessing unit 16. The DS processing module 34 includes a gatewaymodule 78, an access module 80, a grid module 82, and a storage module84. The DS processing module 34 may also include an interface 30 and theDSnet interface 32 or the interfaces 68 and/or 70 may be part of user 12or of the DS processing unit 14. The DS processing module 34 may furtherinclude a bypass/feedback path between the storage module 84 to thegateway module 78. Note that the modules 78-84 of the DS processingmodule 34 may be in a single unit or distributed across multiple units.

In an example of storing data, the gateway module 78 receives anincoming data object that includes a user ID field 86, an object namefield 88, and the data field 40 and may also receive correspondinginformation that includes a process identifier (e.g., an internalprocess/application ID), metadata, a file system directory, a blocknumber, a transaction message, a user device identity (ID), a dataobject identifier, a source name, and/or user information. The gatewaymodule 78 authenticates the user associated with the data object byverifying the user ID 86 with the managing unit 18 and/or anotherauthenticating unit.

When the user is authenticated, the gateway module 78 obtains userinformation from the management unit 18, the user device, and/or theother authenticating unit. The user information includes a vaultidentifier, operational parameters, and user attributes (e.g., userdata, billing information, etc.). A vault identifier identifies a vault,which is a virtual memory space that maps to a set of DS storage units36. For example, vault 1 (i.e., user 1's DSN memory space) includeseight DS storage units (X=8 wide) and vault 2 (i.e., user 2's DSN memoryspace) includes sixteen DS storage units (X=16 wide). The operationalparameters may include an error coding algorithm, the width n (number ofpillars X or slices per segment for this vault), a read threshold T, awrite threshold, an encryption algorithm, a slicing parameter, acompression algorithm, an integrity check method, caching settings,parallelism settings, and/or other parameters that may be used to accessthe DSN memory layer.

The gateway module 78 uses the user information to assign a source name35 to the data. For instance, the gateway module 60 determines thesource name 35 of the data object 40 based on the vault identifier andthe data object. For example, the source name may contain a fileidentifier (ID), a vault generation number, a reserved field, and avault identifier (ID). As another example, the gateway module 78 maygenerate the file ID based on a hash function of the data object 40.Note that the gateway module 78 may also perform message conversion,protocol conversion, electrical conversion, optical conversion, accesscontrol, user identification, user information retrieval, trafficmonitoring, statistics generation, configuration, management, and/orsource name determination.

The access module 80 receives the data object 40 and creates a series ofdata segments 1 through Y 90-92 in accordance with a data storageprotocol (e.g., file storage system, a block storage system, and/or anaggregated block storage system). The number of segments Y may be chosenor randomly assigned based on a selected segment size and the size ofthe data object. For example, if the number of segments is chosen to bea fixed number, then the size of the segments varies as a function ofthe size of the data object. For instance, if the data object is animage file of 4,194,304 eight bit bytes (e.g., 33,554,432 bits) and thenumber of segments Y=131,072, then each segment is 256 bits or 32 bytes.As another example, if segment sized is fixed, then the number ofsegments Y varies based on the size of data object. For instance, if thedata object is an image file of 4,194,304 bytes and the fixed size ofeach segment is 4,096 bytes, the then number of segments Y=1,024. Notethat each segment is associated with the same source name.

The grid module 82 receives the data segments and may manipulate (e.g.,compression, encryption, cyclic redundancy check (CRC), etc.) each ofthe data segments before performing an error coding function of theerror coding dispersal storage function to produce a pre-manipulateddata segment. After manipulating a data segment, if applicable, the gridmodule 82 error encodes (e.g., Reed-Solomon, Convolution encoding,Trellis encoding, etc.) the data segment or manipulated data segmentinto X error coded data slices 42-44.

The value X, or the number of pillars (e.g., X=16), is chosen as aparameter of the error coding dispersal storage function. Otherparameters of the error coding dispersal function include a readthreshold T, a write threshold W, etc. The read threshold (e.g., T=10,when X=16) corresponds to the minimum number of error-free error codeddata slices required to reconstruct the data segment. In other words,the DS processing module 34 can compensate for X−T (e.g., 16−10=6)missing error coded data slices per data segment. The write threshold Wcorresponds to a minimum number of DS storage units that acknowledgeproper storage of their respective data slices before the DS processingmodule indicates proper storage of the encoded data segment. Note thatthe write threshold is greater than or equal to the read threshold for agiven number of pillars (X).

For each data slice of a data segment, the grid module 82 generates aunique slice name 37 and attaches it thereto. The slice name 37 includesa universal routing information field and a vault specific field and maybe 48 bytes (e.g., 24 bytes for each of the universal routinginformation field and the vault specific field). As illustrated, theuniversal routing information field includes a slice index, a vault ID,a vault generation, and a reserved field. The slice index is based onthe pillar number and the vault ID and, as such, is unique for eachpillar (e.g., slices of the same pillar for the same vault for anysegment will share the same slice index). The vault specific fieldincludes a data name, which includes a file ID and a segment number(e.g., a sequential numbering of data segments 1-Y of a simple dataobject or a data block number).

Prior to outputting the error coded data slices of a data segment, thegrid module may perform post-slice manipulation on the slices. Ifenabled, the manipulation includes slice level compression, encryption,CRC, addressing, tagging, and/or other manipulation to improve theeffectiveness of the computing system.

When the error coded data slices of a data segment are ready to beoutputted, the grid module 82 determines which of the DS storage units36 will store the EC data slices based on a dispersed storage memorymapping associated with the user's vault and/or DS storage unitattributes. The DS storage unit attributes may include availability,self-selection, performance history, link speed, link latency,ownership, available DSN memory, domain, cost, a prioritization scheme,a centralized selection message from another source, a lookup table,data ownership, and/or any other factor to optimize the operation of thecomputing system. Note that the number of DS storage units 36 is equalto or greater than the number of pillars (e.g., X) so that no more thanone error coded data slice of the same data segment is stored on thesame DS storage unit 36. Further note that EC data slices of the samepillar number but of different segments (e.g., EC data slice 1 of datasegment 1 and EC data slice 1 of data segment 2) may be stored on thesame or different DS storage units 36.

The storage module 84 performs an integrity check on the outboundencoded data slices and, when successful, identifies a plurality of DSstorage units based on information provided by the grid module 82. Thestorage module 84 then outputs the encoded data slices 1 through X ofeach segment 1 through Y to the DS storage units 36. Each of the DSstorage units 36 stores its EC data slice(s) and maintains a localvirtual DSN address to physical location table to convert the virtualDSN address of the EC data slice(s) into physical storage addresses.

In an example of a read operation, the user device 12 and/or 14 sends aread request to the DS processing unit 14, which authenticates therequest. When the request is authentic, the DS processing unit 14 sendsa read message to each of the DS storage units 36 storing slices of thedata object being read. The slices are received via the DSnet interface32 and processed by the storage module 84, which performs a parity checkand provides the slices to the grid module 82 when the parity check wassuccessful. The grid module 82 decodes the slices in accordance with theerror coding dispersal storage function to reconstruct the data segment.The access module 80 reconstructs the data object from the data segmentsand the gateway module 78 formats the data object for transmission tothe user device.

FIG. 4 is a schematic block diagram of an embodiment of a grid module 82that includes a control unit 73, a pre-slice manipulator 75, an encoder77, a slicer 79, a post-slice manipulator 81, a pre-slice de-manipulator83, a decoder 85, a de-slicer 87, and/or a post-slice de-manipulator 89.Note that the control unit 73 may be partially or completely external tothe grid module 82. For example, the control unit 73 may be part of thecomputing core at a remote location, part of a user device, part of theDS managing unit 18, or distributed amongst one or more DS storageunits.

In an example of write operation, the pre-slice manipulator 75 receivesa data segment 90-92 and a write instruction from an authorized userdevice. The pre-slice manipulator 75 determines if pre-manipulation ofthe data segment 90-92 is required and, if so, what type. The pre-slicemanipulator 75 may make the determination independently or based oninstructions from the control unit 73, where the determination is basedon a computing system-wide predetermination, a table lookup, vaultparameters associated with the user identification, the type of data,security requirements, available DSN memory, performance requirements,and/or other metadata.

Once a positive determination is made, the pre-slice manipulator 75manipulates the data segment 90-92 in accordance with the type ofmanipulation. For example, the type of manipulation may be compression(e.g., Lempel-Ziv-Welch, Huffman, Golomb, fractal, wavelet, etc.),signatures (e.g., Digital Signature Algorithm (DSA), Elliptic Curve DSA,Secure Hash Algorithm, etc.), watermarking, tagging, encryption (e.g.,Data Encryption Standard, Advanced Encryption Standard, etc.), addingmetadata (e.g., time/date stamping, user information, file type, etc.),cyclic redundancy check (e.g., CRC32), and/or other data manipulationsto produce the pre-manipulated data segment.

The encoder 77 encodes the pre-manipulated data segment 92 using aforward error correction (FEC) encoder (and/or other type of erasurecoding and/or error coding) to produce an encoded data segment 94. Theencoder 77 determines which forward error correction algorithm to usebased on a predetermination associated with the user's vault, a timebased algorithm, user direction, DS managing unit direction, controlunit direction, as a function of the data type, as a function of thedata segment 92 metadata, and/or any other factor to determine algorithmtype. The forward error correction algorithm may be Golay,Multidimensional parity, Reed-Solomon, Hamming, Bose Ray ChauduriHocquenghem (BCH), Cauchy-Reed-Solomon, or any other FEC encoder. Notethat the encoder 77 may use a different encoding algorithm for each datasegment 92, the same encoding algorithm for the data segments 92 of adata object, or a combination thereof.

The encoded data segment 94 is of greater size than the data segment 92by the overhead rate of the encoding algorithm by a factor of X/T, whereX is the width or number of slices, and T is the read threshold. In thisregard, the corresponding decoding process can accommodate at most X−Tmissing EC data slices and still recreate the data segment 92. Forexample, if X=16 and T=10, then the data segment 92 will be recoverableas long as 10 or more EC data slices per segment are not corrupted.

The slicer 79 transforms the encoded data segment 94 into EC data slicesin accordance with the slicing parameter from the vault for this userand/or data segment 92. For example, if the slicing parameter is X=16,then the slicer 79 slices each encoded data segment 94 into 16 encodedslices.

The post-slice manipulator 81 performs, if enabled, post-manipulation onthe encoded slices to produce the EC data slices. If enabled, thepost-slice manipulator 81 determines the type of post-manipulation,which may be based on a computing system-wide predetermination,parameters in the vault for this user, a table lookup, the useridentification, the type of data, security requirements, available DSNmemory, performance requirements, control unit directed, and/or othermetadata. Note that the type of post-slice manipulation may includeslice level compression, signatures, encryption, CRC, addressing,watermarking, tagging, adding metadata, and/or other manipulation toimprove the effectiveness of the computing system.

In an example of a read operation, the post-slice de-manipulator 89receives at least a read threshold number of EC data slices and performsthe inverse function of the post-slice manipulator 81 to produce aplurality of encoded slices. The de-slicer 87 de-slices the encodedslices to produce an encoded data segment 94. The decoder 85 performsthe inverse function of the encoder 77 to recapture the data segment90-92. The pre-slice de-manipulator 83 performs the inverse function ofthe pre-slice manipulator 75 to recapture the data segment 90-92.

FIG. 5 is a diagram of an example of slicing an encoded data segment 94by the slicer 79. In this example, the encoded data segment 94 includesthirty-two bits, but may include more or less bits. The slicer 79disperses the bits of the encoded data segment 94 across the EC dataslices in a pattern as shown. As such, each EC data slice does notinclude consecutive bits of the data segment 94 reducing the impact ofconsecutive bit failures on data recovery. For example, if EC data slice2 (which includes bits 1, 5, 9, 13, 17, 25, and 29) is unavailable(e.g., lost, inaccessible, or corrupted), the data segment can bereconstructed from the other EC data slices (e.g., 1, 3 and 4 for a readthreshold of 3 and a width of 4).

FIG. 6A is a diagram illustrating an example of a linked directory filestructure. The structure includes a plurality of linked directory files102-108, wherein each directory file is stored in a dispersed storagenetwork (DSN) memory as one or more sets of encoded directory slices,and wherein each directory file is accessible at a source name DSNaddress. For example, a first directory file 102 is accessible at sourcename B530, a second directory file 104 is accessible at source name90DE, a third directory file 106 is accessible at source name 90E0, anda fourth directory file 108 is accessible at D7B9.

Each directory file includes one or more entries, wherein each entryincludes a file name field 110, an extra data field 112, and a sourcename field 114. For each entry of the directory file, the file namefield 110 includes a file name entry associated with the directory fileentry. The file name entry indicates at least a portion of a pathnamefrom a root name to a filename. For example, a file name entry of/pics.html indicates a file name linking to a file. As another example,a file name entry of /papers indicates a continuing pathname linking toat least one other directory file. The extra data field 112 includes anextra data entry associated with the directory file entry. The extradata entry includes one or more of a snapshot identifier (ID), atimestamp, the size indicator, a segment allocation table (SAT) vaultsource name, metadata, and content (e.g., a portion of data filecontent). The source name field 114 includes a source name entryassociated with the directory file entry. The source name entryindicates a DSN source name address (e.g., including a vault ID, ageneration indicator, and an object number) of at least one of a linkeddata file and a linked directory file. For example, a source name entryof B673 indicates a source name associated with the directory file entryof data file /pics.html. As another example, a source name entry of D7B9indicates a source name associated with a directory file entry of path/papers linked to the fourth directory file 108 (e.g., stored as one ormore encoded directory slices at source name D7B9).

The linked directory file structure may be utilized to locate a DSNsource name address of a desired data file stored as a plurality of setsof encoded data slices. For example, a source name address correspondingto data file /lists/set/bar.htm is desired. The first directory file 102is accessed at source name B530 and the linked second directory file 104source name address of 90DE is extracted from an entry of the sourcename field corresponding to a file name field entry of /lists within thefile name field 110. Next, the second directory file 104 is accessed atsource name 90DE and the linked second directory file source nameaddress of 90E0 is extracted from an entry of the source name field 114corresponding to a file name field entry of /lists/set within the filename field 100 and. Next, the third directory file 106 is accessed atsource name 90E0 and a data file source name address of 90E2 isextracted from an entry of the source name field 114 corresponding to afile name field entry of /lists/set/bar.htm within the file name field110. The DSN source name address 90E2 may be subsequently accessed torecover the desired data file of data file /lists/set/bar.htm. Thedirectory file structure may be utilized in a method to access ahypertext markup language (HTML) file stored in the DSN memory. Such amethod is discussed in greater detail with reference to FIGS. 6B-6C.

FIG. 6B is a schematic block diagram of another embodiment of acomputing system that includes a computing device 120, a requestingentity 154, and a dispersed storage network (DSN) memory 22. Thecomputing device may include at least one of a user device, a dispersedstorage (DS) processing unit, a DS unit, a DS managing unit, and anyother computing device operable to couple with the DSN memory 22. Thecomputing device 120 includes a dispersed storage (DS) module 122. Therequesting entity 154 includes at least one of the DS module 122, theuser device, the DS processing unit, the DS unit, the DS managing unit,and any other computing device. The DS module 122 includes a receiverequest module 124, a translate module 126, a request retrieval module128, a reconstruct module 130, an output file module 132, and a serverresponse module 134.

The receive request module 124, when operable within the computingdevice 120, causes the computing device 120 to receive a request 136 fora hypertext markup language (HTML) file 138, wherein the HTML file 138is encoded using a dispersed storage (DS) error coding function toproduce a plurality of sets of encoded data slices, wherein theplurality of sets of encoded data slices is stored in the DSN memory 22,and wherein the request includes a universal record locator (URL) 140associated with the HTML file 138. The receive request module 124further functions to receive the request 136 by receiving a GET requestin accordance with a hypertext protocol (HTTP). The receive requestmodule 124 further functions to receive the request 136 from therequesting entity 154. The requesting entity 154 includes at least oneof a user device, a DS processing unit, a DS unit, a DS managing unit, amodule of the computing device 120, a module of the DS module 122, and amodule within the DSN.

The translate module 126, when operable within the computing device 120,causes the computing device 120 to translate the URL 140 into a sourcename 142 associated with the plurality of sets of encoded data slices.The translate module 126 functions to translate the URL 140 into thesource name 138 by obtaining a root directory associated with the DSNmemory 22, identifying a pathname based on the URL 140 and the rootdirectory, and accessing a DSN index utilizing the pathname to retrievethe source name 142. For example, the translate module 126 obtains aroot directory associated with a DSN memory 22 of http://cleversafe andidentifies a pathname of http://cleversafe/lists/foo.html based on a URLof /lists/foo.html and the root directory of http://cleversafe. Next,the translate module 126 accesses the DSN index utilizing the pathnameof http://cleversafe/lists/foo.html to retrieve a source name of 90DF.For instance, the translate module 126 accesses a directory file atsource name B530 to match a filename of /lists to identify a source nameof 90DE associated with a subsequent directory file at source name 90DE.Next, the translate module 126 accesses the directory file at sourcename 90DE and matches a filename of lists/foo.html to identify thesource name of 90DF associated with the desired HTML file 138. Thetranslate module 126 further functions to translate the URL 140 into thesource name 138 by accessing a URL to source name table utilizing theURL140 to retrieve the source name 142. For example, the translatemodule 126 utilizes the URL of /lists/foo.html to index into the URL tosource name table to retrieve the source name of 90DF.

The request retrieval module 128, when operable within the computingdevice 120, causes the computing device 120 to request retrieval of aplurality of sets of at least a decode threshold number of encoded dataslices 144 of the plurality of sets of encoded data slices from the DSNmemory 22 in accordance with the source name 142. The request retrievalmodule 128 functions to request retrieval by generating a plurality ofsets of at least a decode threshold number of slice names correspondingto the plurality of sets of at least the decode threshold number ofencoded data slices 144 based on the source name 142, generating aplurality of sets of at least a decode threshold number of read slicerequests 146 that includes the plurality of sets of least the decodethreshold number of slice names, and sending the plurality of sets of atleast the decode threshold number of read slice requests 146 to the DSNmemory 22.

The reconstruct module 130, when operable within the computing device120, causes the computing device 120 to, as the plurality of sets of atleast a decode threshold number of encoded data slices 144 is beingreceived, reconstruct the HTML file 138 from the plurality of sets ofthe at least the decode threshold number of encoded data slices 144. Thereconstruct module 130 functions to reconstruct the HTML file 138 by,for each set of the at least the decode threshold number of encoded dataslices, decoding the set of at least the decode threshold number ofencoded data slices using the DS error coding function to produce a datasegment of a plurality of data segments. Next, the reconstruct module130 aggregates the plurality of data segments to reproduce the HTML file138.

The output file module 132, when operable within the computing device120, causes the computing device 120 to output the HTML file 138 to therequesting entity 154 in accordance with a hypertext protocol (HTTP).For example, the output file module 132 adds at least one of a header, astatus code, an error message to output the HTML file 138 in accordancewith the HTTP. The output file module 132 further functions to outputthe HTML file 138 by outputting the source name 142 to the requestingentity 154, such that the requesting entity 154 caches the source name142 for subsequent access of the HTML file 138.

The server response module 134, when operable within the computingdevice 120, causes the computing device 120 to generate one or morehypertext protocol (HTTP) response status codes based on a response 150to the requesting retrieval of the plurality of sets of the at least thedecode threshold number of encoded data slices (e.g., request info 152),generate a server response 148 that includes at least one of the HTMLfile 138 and the one or more HTTP response status codes, and output theserver response 148 to the requesting entity 154. The server responsemodule 134 generates the one or more HTTP response status codes toinclude one or more of an OK code #200 when retrieval of the HTML file138 is favorable, an accepted code #202 when the source name 142 isvalid within the DSN memory 22, a no content code #204 when the HTMLfile 138 does not exist in the DSN memory 22, a bad request code #400when the URL 140 does not translate into a valid source than 142, and anunauthorized code #401 when the requesting entity 154 is not allowed toaccess the HTML file 138 from the DSN memory 22.

FIG. 6C is a flowchart illustrating an example of accessing a data file.The method begins at step 160 where a processing module (e.g., of adispersed storage (DS) processing module) receives a request for ahypertext markup language (HTML) file, wherein the HTML file is encodedusing a dispersed storage (DS) error coding function to produce aplurality of sets of encoded data slices, wherein the plurality of setsof encoded data slices is stored in a dispersed storage network (DSN)memory, and wherein the request includes a universal record locator(URL) associated with the HTML file. The receiving the request furtherincludes receiving a GET request in accordance with a hypertext protocol(HTTP).

The method continues at step 162 where the processing module translatesthe URL into a source name associated with the plurality of sets ofencoded data slices. The translating the URL into the source nameincludes obtaining a root directory associated with the DSN memory,identifying a pathname based on the URL and the root directory (e.g., byappending the URL to the root directory), and accessing a DSN indexutilizing the pathname to retrieve the source name. For example, theprocessing module produces a full pathname ofc:\urldirectory\lists\set\bar.htm when the root directory isc:\urldirectory and the URL is lists\set\bar.htm. As another example,the processing module accesses a DSN index (e.g., a DSN directorystructure as illustrated in FIG. 6A) utilizing the full pathname ofc:\urldirectory\lists\set\bar.htm to retrieve source name 90E2. Thetranslating the URL into the source name further includes accessing aURL to source name table or directory utilizing the URL to retrieve thesource name (e.g., a lookup). For example, processing module accessesthe URL to source name directory utilizing the URL of \lists\set\bar.htmto retrieve source name 90E2.

The method continues at step 164 where the processing module requestsretrieval of a plurality of sets of at least a decode threshold numberof encoded data slices of the plurality of sets of encoded data slicesfrom the DSN memory in accordance with the source name. The requestingretrieval includes generating a plurality of sets of at least a decodethreshold number of slice names corresponding to the plurality of setsof at least the decode threshold number of encoded data slices based onthe source name, generating a plurality of sets of at least a decodethreshold number of read slice requests that includes the plurality ofsets of least the decode threshold number of slice names, and sendingthe plurality of sets of at least the decode threshold number of readslice requests to the DSN memory.

The method continues at step 166 where, as the plurality of sets of atleast a decode threshold number of encoded data slices is beingreceived, the processing module reconstructs the HTML file from theplurality of sets of the at least the decode threshold number of encodeddata slices. The reconstructing the HTML file includes, for each set ofthe at least the decode threshold number of encoded data slices,decoding the at least the decode threshold number of encoded data slicesusing the DS error coding function to produce a data segment of aplurality of data segments. Next, the plurality of data segments areaggregated to reproduce the HTML file.

The method continues at step 168 where the processing module outputs theHTML file to a requesting entity in accordance with a hypertext protocol(HTTP). For example, the processing module adds at least one of aheader, a status code, an error message to output the HTML file inaccordance with the HTTP. The outputting the HTML file further includesoutputting the source name to the requesting entity, such that therequesting entity caches the source name for subsequent access of theHTML file.

The method continues at step 170 where the processing module generatesone or more hypertext protocol (HTTP) response status codes based onresponse to the requesting retrieval of the plurality of sets of the atleast the decode threshold number of encoded data slices. The generatingincludes generates the one or more HTTP response status codes to includeone or more of an OK code #200 when retrieval of the HTML file 138 isfavorable, an accepted code #202 when the source name 142 is validwithin the DSN memory 22, a no content code #204 when the HTML file 138does not exist in the DSN memory 22, a bad request code #400 when theURL 140 does not translate into a valid source than 142, and anunauthorized code #401 when the requesting entity 154 is not allowed toaccess the HTML file 138 from the DSN memory 22. The method continues atstep 172 where the processing module generates a server response inaccordance with the HTTP that includes at least one of the HTML file andthe one or more HTTP response status codes. The method continues at step174 where the processing module outputs the server response to therequesting entity. Alternatively, the processing module outputs the HTMLfile exclusively within the server response.

FIG. 7A is a diagram illustrating an example of a directory filestructure. The structure includes a universal record locator (URL) tosource name directory file 180, wherein the directory file 180 is storedin a dispersed storage network (DSN) memory as one or more sets ofencoded directory slices, and wherein the directory file is accessibleat a source name DSN address. For example, the URL to source namedirectory file 180 is accessible at source name B531.

The directory file 180 includes one or more entries, wherein eachdirectory file entry includes a URL field 182, an extra data field 112,and a source name field 184. For each entry of the directory file 180,the URL field 182 includes an URL entry associated with the directoryfile entry. The one or more entries of the directory file 180 may besorted by the URL entry in accordance with a sorting scheme (e.g.,numeric, alphanumeric, by file extension type, by content type, etc.).The URL entry indicates at least a portion of a pathname that includes afilename of a hypertext markup language (HTML) data file stored in theDSN memory. For example, a URL entry of /pics.html indicates a URLlinking to HTML data file pic.html. As another example, a URL entry of/papers/stuff.htm indicates a file name linking to HTML data filestuff.htm.

The extra data field 112 includes an extra data entry associated withthe directory file entry. The extra data entry includes one or more of asnapshot identifier (ID), a timestamp, the size indicator, a segmentallocation table (SAT) vault source name, metadata, and content (e.g., aportion of data file content). The source name field 184 includes asource name entry associated with the directory file entry. The sourcename entry indicates a DSN source name address (e.g., including a vaultID, a generation indicator, and an object number) of an HTML data file.For example, a source name entry of B673 indicates a source nameassociated with the directory file entry of HTML data file /pics.html.As another example, a source name entry of D7BA indicates a source nameassociated with a directory file entry of HTML data file/papers/stuff.htm.

The a directory file structure may be utilized to locate a DSN sourcename address of a desired HTML data file that is stored as a pluralityof sets of encoded data slices in the DSN memory. For example, a sourcename address corresponding to HTML data file /lists/set/bar.htm isdesired. The directory file 180 is accessed at source name B531 and theHTML data file source name address of 90E2 is extracted from an entry ofthe source name field 184 corresponding to a URL field entry of/lists/set/bar.htm within the URL field when the desired data file is aHTML data file. DSN source name address 90E2 may be subsequentlyaccessed to recover the desired HTML data file /lists/set/bar.htm.

FIG. 7B is a flowchart illustrating another example of accessing a datafile, that includes similar steps to FIG. 6C. The method begins withstep 160 of FIG. 6C where a processing module (e.g., of a dispersedstorage (DS) processing module) receives a request for a hypertextmarkup language (HTML) file, wherein the request includes a universalrecord locator (URL) associated with the HTML file.

The method continues at step 186 where the processing module retrieves asource name corresponding to the URL from a URL to source name directoryfile. For example, the processing module accesses a source name within adispersed storage network (DSN) associated with the URL to source namedirectory file when the request includes the URL to retrieve encodeddirectory slices. The processing module dispersed storage error decodesthe directory slices to produce the URL to source name directory file.The processing module identifies a URL field entry corresponding to theURL and extracts the source name corresponding to the URL.

The method continues with steps 164-168 of FIG. 6C where the processingmodule request retrieval of a plurality of sets of at least a decodethreshold number of encoded data slices of a plurality of sets ofencoded data slices associated with the HTML file, reconstructs the HTMLfile from the plurality of sets of at least a decode threshold number ofencoded data slices, and outputs the HTML file.

FIG. 8A is a diagram illustrating an example of a web page filestructure. The a structure includes a hypertext markup language (HTML)data file 190, wherein the HTML data file 190 is stored in a dispersedstorage network (DSN) as one or more sets of encoded data slices, andwherein the HTML data file is accessible at a DSN address (e.g., asource name) of DSN location information.

The HTML data file 190 includes one or more elements 1-E. For example,the HTML data file 190 includes a structural element 1 (e.g., includingweb page structure information), a data element 2 (e.g., includingpresentation information), a DSN information element 1 (e.g., DSNregistry information, vault information, codec stack information, aprimary source name, one or more secondary source names including sourcenames of video files of common content but with different resolutions,and a data file offset), and a DSN hypertext element 192 (e.g.,including DSN hypertext element information).

The DSN hypertext element 192 includes one or more of a DSN identifier(ID), a DSN internet protocol (IP) address, a DS unit storage set ID, aDS unit storage set IP address set, a root universal record locator(URL), a source name of a linked file (e.g., web page) associated withthe root URL, a file name, a file ID, a vault ID, and a snapshot ID. Forexample, a DSN hypertext element displayed as “FOO list” may include aDSN ID as identified in the DSN hypertext element as <ahsource=“http://cleversafe.com/90E1”>FOO List</a>. In such an instance,a desired HTML data file of foo.htm may be retrieved from source nameaddress 90E1 of the cleversafe.com DSN domain when the DSN hypertextelement is selected.

FIG. 8B is a schematic block diagram of another embodiment of acomputing system that includes a computing device 200 and a dispersedstorage network (DSN) memory 22. The computing device 200 may include atleast one of a user device, a dispersed storage (DS) processing unit, aDS unit, a DS managing unit, and any other computing device operable tocouple with the DSN memory 22. The computing device 200 includes adispersed storage (DS) module 202. The DS module 202 includes adetermine DSN location information module 204, an interpret DSN locationinformation module 206, a decode module 208, and a cache module 210.

The determine DSN location information module 204, when operable withinthe computing device 200, causes the computing device 200 to, when asecond web page 212 is selected based on an element 214 of a first webpage 216, determine DSN location information 218 for the second web page212. For example, the first web page 216 is presented (e.g., displayed)which includes rendering an image associated with a plurality ofelements that includes the element 214 and a selection is produced thatincludes the element 214 (e.g., a user clicks on a portion of an imageassociated with the element 214). The determine DSN location informationmodule 204 determines the DSN location information 218 by at least oneextracting the DSN location information 218 from the element 214 of thefirst web page 216, wherein the element 214 is a hypertext element anddetermining the DSN location information 218 based on selection of thehypertext element. The determining includes one or more of extractingthe DSN location information 218 from the hypertext element, retrievingthe DSN location information 8 21 from a hypertext element tableutilizing the hypertext element as an index into the table, andretrieving the DSN location information 218 from the DSN utilizing a DSNaddress from the hypertext element.

The determine DSN location information module 204 further determines theDSN location information 218 by at least one of determining a DSNidentifier (ID) that identifies one of a plurality of dispersed storagenetworks and determining DSN addressing information regarding storage ofthe plurality of sets of the least the decode threshold number ofencoded data slices. The determining the DSN ID includes identifying,from the element 214, one or more of a DSN number, a DSN internetprotocol address, a dispersed storage (DS) unit storage set ID, and setof internet protocol addresses corresponding to the DS unit storage set.The determining the DSN addressing information includes identifying,from the element 214, one or more a universal record locator (URL), aDSN vault ID, a source name corresponding to a second web page file, asource name corresponding to a segment allocation table, a plurality ofsets of slice names corresponding to the plurality of sets of at leastthe decode threshold number of encoded data slices, a pathnamecorresponding to the second web page file, a filename, a revisionnumber, and a snapshot ID. The determine DSN location information module204, when operable within the computing device 200, further causes thecomputing device 200 to, when a third web page is selected based on ahypertext element of the second web page 212, determine third DSNlocation information for the third web page.

The interpret DSN location information module 206, when operable withinthe computing device 200, causes the computing device 200 to interpretthe DSN location information 218 to request retrieval of a plurality ofsets of at least a decode threshold number of encoded data slices 220from a DSN (e.g., from the DSN memory 22). The interpret DSN locationinformation module 206 further interprets the DSN location information218 by at least one of determining slices names for the plurality ofsets of the least the decode threshold number of encoded data slices 220and issuing a plurality of requests 222 based on the slices names anddetermining DS units storing the plurality of sets of the least thedecode threshold number of encoded data slices and issuing a pluralityof requests to the DS units. The issuing the plurality of requests tothe DS units includes generating the plurality of requests to includethe slice names (e.g., one request per slice name, one request per groupof slice names that include a common pillar number), outputting theplurality of requests to the DS units, and receiving the plurality ofsets of the at least the decode threshold number of encoded data slices220. The interpreting the DSN location information to request retrievalfurther includes generating a second web page file request that includesat least a portion of the DSN location information, identifying the DSNfrom the DSN location information, sending the second web page filerequest to the DSN (e.g., send to internet protocol address of DSN or tointernet protocol addresses of the DS units), and receiving the secondwebpage file from the DSN. The interpret DSN location information module206, when operable within the computing device 200, further causes thecomputing device 200 to, when the third web page is selected, interpretthe third DSN location information to request retrieval of a thirdplurality of sets of at least a decode threshold number of encoded dataslices from the DSN.

The decode module 208, when operable within the computing device 200,causes the computing device 200 to decode, using a DS error codingfunction, a set of the plurality of sets of the least the decodethreshold number of encoded data slices 220 to reproduce an element 224of the second web page 212. The decoding further includes decoding,using the DS error coding function, two or more sets of the plurality ofsets of the least the decode threshold number of encoded data slices 220to reproduce the element 222 of the second web page 212. The decodemodule 208 is further operable to decode, using the DS error codingfunction, a second set of the plurality of sets of the least the decodethreshold number of encoded data slices 220 to reproduce at least aportion of a second element of the second web page. The decode module208 is further operable to decode, using the DS error coding function,the second set of the plurality of sets of the least the decodethreshold number of encoded data slices to reproduce a portion of athird element and a portion of a fourth element of the second web page.The decode module 208, when operable within the computing device 200,further causes the computing device 200 to, when the third web page isselected, decode, using the DS error coding function, a set of the thirdplurality of sets of the least the decode threshold number of encodeddata slices to reproduce an element of the third web page.

The cache module 210, when operable within the computing device 200,causes the computing device 200 to cache a plurality of elements of thefirst web page 216, wherein the plurality of elements includes theelement 214. Such caching enables subsequent reloading of the first webpage 216. The caching includes one or more of receiving the first webpage 216, receiving the plurality of elements of the first web page 216,receiving the element 214, and facilitating storage of the plurality ofelements of the first webpage 216 (e.g., in a local cache memory, in theDSN).

FIG. 8C is a flowchart illustrating an example of accessing a secondaryweb page file. The method begins at step 230 where a processing module(e.g., a dispersed storage module), when a second web page is selectedbased on an element of a first web page, determines dispersed storagenetwork (DSN) location information for the second web page. For example,the first web page is presented (e.g., displayed) which includesrendering an image associated with a plurality of elements that includesthe element and a selection is produced that includes the element (e.g.,a user clicks on a portion of an image associated with the element). Thedetermining the DSN location information includes at least oneextracting the DSN location information from the element of the firstweb page, wherein the element is a hypertext element and determining theDSN location information based on selection of the hypertext element.The determining includes one or more of extracting the DSN locationinformation from the hypertext element, retrieving the DSN locationinformation from a hypertext element table utilizing the hypertextelement as an index into the table, and retrieving the DSN locationinformation from the DSN utilizing a DSN address from the hypertextelement.

The determining the DSN location information further includes at leastone determining a DSN identifier (ID) that identifies one of a pluralityof dispersed storage networks and determining DSN addressing informationregarding storage of the plurality of sets of the least the decodethreshold number of encoded data slices. The determining the DSNlocation information includes identifying, from the element, one or moreof a DSN number, a DSN internet protocol address, a dispersed storage(DS) unit storage set ID, and set of internet protocol addressescorresponding to the DS unit storage set. For example, the processingmodule extracts a DSN ID of cleversafe.com and a source name of 90E1when hypertext element selection is <ahsource=“http://cleversafe.com/90E1”>FOO List</a>.

The determining the DSN addressing information includes identifying,from the element, one or more a universal record locator (URL), a DSNvault ID, a source name corresponding to a second web page file, asource name corresponding to a segment allocation table, a plurality ofsets of slice names corresponding to the plurality of sets of at leastthe decode threshold number of encoded data slices, a pathnamecorresponding to the second web page file, a filename, a revisionnumber, and a snapshot ID.

The method continues at step 232 where the processing module caches aplurality of elements of the first web page, wherein the plurality ofelements includes the element. The caching includes one or more ofreceiving the first web page, receiving the plurality of elements of thefirst web page, receiving the element, and facilitating storage of theplurality of elements of the first webpage (e.g., in a local cachememory, in the DSN).

The method continues at step 234 where the processing module interpretsthe DSN location information to request retrieval of a plurality of setsof at least a decode threshold number of encoded data slices from a DSN.The requesting retrieval of the plurality of sets of at least the decodethreshold number of encoded data slices from the DSN includes at leastone of sending a request to the DSN, sending a set of requests to a setof DS units of the DSN, and sending a plurality of requests to the DSunits. The interpreting the DSN location information further includes atleast one of determining slices names for the plurality of sets of theleast the decode threshold number of encoded data slices and issuing aplurality of requests based on the slices names and determining DS unitsstoring the plurality of sets of the least the decode threshold numberof encoded data slices and issuing a plurality of requests to the DSunits.

The issuing the plurality of requests to the DS units includesgenerating the plurality of requests to include the slice names (e.g.,one request per slice name, one request per group of slice names thatinclude a common pillar number), identifying internet protocol addressesof the DS units, outputting the plurality of requests to the DS units,and receiving the plurality of sets of the at least the decode thresholdnumber of encoded data slices. The identifying of the internet protocoladdresses of the DS units includes at least one of performing a tablelookup based on the DSN ID and a domain name system (DNS) server querybased on the DSN ID (e.g., cleversafe.com). The interpreting the DSNlocation information to request retrieval further includes generating asecond web page file request that includes at least a portion of the DSNlocation information, identifying the DSN from the DSN locationinformation, sending the second web page file request to the DSN (e.g.,send to internet protocol address of DSN or to internet protocoladdresses of the DS units), and receiving the second webpage file fromthe DSN.

The method continues at step 236 where the processing module decodes,using a DS error coding function, a set of the plurality of sets of theleast the decode threshold number of encoded data slices to reproduce anelement of the second web page. The decoding further includes decoding,using the DS error coding function, two or more sets of the plurality ofsets of the least the decode threshold number of encoded data slices toreproduce the element Of the second webpage.

The method continues at step 238 where the processing module decodes,using the DS error coding function, a second set of the plurality ofsets of the least the decode threshold number of encoded data slices toreproduce at least a portion of a second element of the second web page.The method continues at step 240 where the processing module decodes,using the DS error coding function, the second set of the plurality ofsets of the least the decode threshold number of encoded data slices toreproduce a portion of a third element and a portion of a fourth elementof the second web page. The method continues at step 242 where theprocessing module, when a third web page is selected based on ahypertext element of the second web page, determines third DSN locationinformation for the third web page. The method continues at step 244where the processing module interprets the third DSN locationinformation to request retrieval of a third plurality of sets of atleast a decode threshold number of encoded data slices from the DSN. Themethod continues at step 246 where the processing module decodes, usingthe DS error coding function, a set of the third plurality of sets ofthe least the decode threshold number of encoded data slices toreproduce an element of the third web page.

FIG. 9A is a diagram illustrating an example of a domain name system(DNS) data file structure. The structure includes a DNS data file 250,wherein the DNS data file 250 may be stored in a dispersed storagenetwork (DSN) as one or more sets of encoded data slices, and whereinthe DNS data file 250 is accessible via a source name DSN address of theDNS data file when the DNS data file is stored as the one or more setsof encoded data slices.

The DNS data file 250 includes one or more DNS data file entries,wherein each DNS data file entry of the one more DNS data file entriesincludes a universal record locator (URL) domain field 252, a sourcename field 254, a DSN Internet protocol (IP) address field 256, and adispersed storage (DS) unit storage set IP address range field 258. Foreach DNS data file entry, the URL domain field 252 includes a URL domainentry that includes a URL domain name associated with a DSN of the DNSdata file entry utilized to store at least one hypertext markup language(HTML) data file. For example, a URL domain entry of www.cleversafe.comindicates at least one HTML data file associated with thewww.cleversafe.com domain.

The source name field 254 includes a source name entry corresponding tothe URL domain entry of the DNS data file entry that includes a DSNsource name address (e.g., including a vault identifier (ID), a vaultgeneration ID, and an object number) associated with a HTML data filestored as encoded slices within a DSN. For example, a source name entryof 90E1 indicates a source name of a HTML data file stored at a DSNsystem associated with the www.cleversafe.com domain with a DSN IPaddress of 66.232.111.124.

The DSN IP address field 256 includes a DSN IP address entrycorresponding to the URL domain entry of the DNS data file entry thatincludes an IP address associated with the URL domain entry. Forexample, a DSN system of the www.cleversafe.com domain may be accessedutilizing a DSN IP address of 66.232.111.124. The DS unit storage set IPaddress range field 258 includes a DS unit storage set IP address rangeentry corresponding to the source name entry of the DNS data file entrythat identifies IP address ranges associated with a DS unit storage setwithin the DSN that utilized to store the HTML data file correspondingto the source name entry. For example, a DS unit storage set may beaccessed at an IP address range of 66.232.111.125-66.232.111.128 toaccess the HTML data file stored at the source name of 90E1 within theDSN system associated with the www.cleversafe.com domain. As anotherexample, a DS unit storage set may be accessed at an IP address range of66.232.111.136-66.232.111.139 to access a HTML data file stored at thesource name of 90E2 within the DSN system associated with a URL domainentry of www.cleversafe.com/list.doc.

FIG. 9B is a schematic block diagram of another embodiment of acomputing system that includes a computing device 260, a client 276, anda dispersed storage network (DSN) 282. The DSN 282 includes a DSNmanagement server 18 (e.g., a DS managing unit 18) and may also includeone or more of a dispersed storage (DS) processing unit and one or moresets of DS units. The client 276 may include a user device. Thecomputing device 260 includes a DS module 262 and a memory 278. Thecomputing device 260 may be implemented utilizing at least one of a userdevice, a DS processing unit, a DS unit, a DS managing unit, and anyother computing device. The memory 278 includes a domain name system(DNS) table 280. The DS module 262 includes a receive request module264, a search module 266, an ascertain DSN location information module268, an output information module 270, a create entry module 272, and anupdate DNS table module 274.

The receive request module 264, when operable within the computingdevice 260, causes the computing device 260 to receive, from the client276, a request 284 regarding DSN location information 286 of a hypertextmarkup language (HTML) file. The request 284 includes at least one of aretrieval request and a creation request. The retrieval request includesat least one of an identifier (ID) of the DSN 282, a universal recordlocator (URL) associated with the HTML file, and a source nameassociated with a plurality of sets of encoded data slices of the HTMLfile. The DSN location information 286 includes at least one of a set ofDS unit internet protocol addresses 300, a plurality of sets of slicenames associated with the plurality of sets of encoded data slices, anidentifier of the DSN 282, and a DSN internet protocol (IP) address 290for the DSN management server 18.

The search module 266, when operable within the computing device 260,causes the computing device 260 to search the DNS table 280 for an entry288 regarding the HTML file based on information of the request 284. Thesearch module 266 further functions to search the DNS table 280 for theentry 288 based on the at least one of the identifier of the DSN, theURL, and the source name of the request 284 when the request 284 is theretrieval request. The search module 266 further functions to search theDNS table 280 for the entry 288 based on the source name when theretrieval request includes the source name. The ascertain DSN locationinformation module 268, when operable within the computing device 260,causes the computing device 260 to, when the entry 288 is found,ascertain the DSN location information 286 regarding the plurality ofsets of encoded data slices, wherein the HTML file is encoded using a DSerror coding function to produce the plurality of sets of encoded dataslices and wherein the plurality of sets of encoded data slices isstored in the DSN 282.

The output information module 270, when operable within the computingdevice 260, causes the computing device 260 to output the DSN locationinformation 286 to the client 276. The output information module 270further functions to output the DSN location information 286 bydetermining whether accessing the HTML file requires authentication andwhen accessing the HTML file requires authentication, outputting, to theclient 276, a DSN internet protocol (IP) address 290 for the DSNmanagement server 18 and when an authentication notice is received(e.g., from the DSN management server 18, from the client 276),outputting the DSN location information 286 to the client 276. Theoutput information module 270 further functions to output the DSNlocation information 286 by determining whether accessing the HTML filerequires authentication and when accessing the HTML file requiresauthentication, outputting a DSN authentication request 292 to the DSNmanagement server 18 based on the DSN internet protocol address 290.Next, the output information module 270 receives, from the DSNmanagement server 18, a DSN authentication response 294 that includes asigned certificate 296, and outputs the DSN location information 286 andthe signed certificate 296 to the client 276.

The create entry module 272, when operable within the computing device260, causes the computing device 260 to, when the request 284 is thecreation request to create the entry 288 in the DNS table 280, createthe entry 288 to include one or more of, an identifier of the DSN, auniversal record locator (URL) associated with the HTML file, a sourcename associated with the plurality of sets of encoded data slices, andthe DSN IP address 290 for the DSN management server 18. The update DNStable module 274, when operable within the computing device 260, causesthe computing device 260 to update the DNS table 280 by one or more ofaccessing a DSN index of the DSN 282 based on a domain name of the DSNto retrieve a plurality of source names 298 that includes the sourcename and accessing a slice location table utilizing the source name toretrieve the set of DS unit internet protocol addresses 300. Forexample, the update DNS table module 274 accesses the DSN index toretrieve the corresponding plurality of source names corresponding to aplurality of files stored in the DSN. Next, the update DNS table module274 accesses the slice location table utilizing the plurality of sourcenames to retrieve a plurality of sets of DS unit IP addresses thatincludes the set of DS unit IP addresses 300.

FIG. 9C is a flowchart illustrating an example of providing dispersedstorage network location information. The method begins at step 302where a processing module (e.g., of a computing device, of a server)receives, from a client, a request regarding dispersed storage network(DSN) location information of a hypertext markup language (HTML) file.The DSN location information includes at least one of a set of DS unitinternet protocol (IP) addresses, a plurality of sets of slice namesassociated with the plurality of sets of encoded data slices of the HTMLfile, an identifier (ID) of a DSN, and a DSN internet protocol (IP)address for a DSN management server. The request includes at least oneof a retrieval request and a creation request. The retrieval requestincludes at least one of the ID of the DSN, a universal record locator(URL) associated with the HTML file, and a source name associated withthe plurality of sets of encoded data slices.

The method continues at step 304 where the processing module searches adomain name system (DNS) table for an entry regarding the HTML filebased on information of the request. The searching includes searchingthe DNS table for the entry based on the at least one of the identifierof the DSN, the URL, and the source name when the request is a retrievalrequest. The searching further includes searching the DNS table for theentry based on the source name when the request is the retrieval requestand the request includes the source name.

When the entry is found, the method continues at step 306 where theprocessing module ascertains the DSN location information regarding theplurality of sets of encoded data slices, wherein the HTML file isencoded using a dispersed storage (DS) error coding function to producethe plurality of sets of encoded data slices and wherein the pluralityof sets of encoded data slices is stored in the DSN. The methodcontinues at step 308 where the processing module outputs the DSNlocation information to the client. The outputting the DSN locationinformation further includes determining whether accessing the HTML filerequires authentication and when accessing the HTML file requiresauthentication, outputting, to the client, the DSN IP address for theDSN management server and when an authentication notice is received(e.g., from the DSN management server, from the client), outputting theDSN location information to the client.

The outputting the DSN location information further includes determiningwhether accessing the HTML file requires authentication and whenaccessing the HTML file requires authentication, outputting a DSNauthentication request to the DSN management server based on the DSN IPaddress, receiving, from the DSN management server, a DSN authenticationresponse that includes a signed certificate, and outputting the DSNlocation information and the signed certificate to the client. Next, theclient stores the signed certificate for subsequent retrieval requestsfor the HTML file.

When the request is a creation request to create the entry in the DNStable, the method continues at step 310 where the processing modulecreates the entry to include one or more of the ID of the DSN, theuniversal record locator (URL) associated with the HTML file, the sourcename associated with the plurality of sets of encoded data slices, andthe DSN IP address for the DSN management server. The method may branchback to step 306 to ascertain the DSN location information from thecreated entry when the request also includes the retrieval request.

The method continues at step 312 where the processing module updates theDNS table. The updating includes one or more of accessing a DSN index ofthe DSN based on a domain name of the DSN to retrieve a plurality ofsource names that includes the source name and accessing a slicelocation table utilizing the source name to retrieve a set of DS unitinternet protocol addresses.

FIG. 10 is a flowchart illustrating an example of generating an auditobject. The method begins at step 320 where a processing module (e.g.,of a dispersed storage (DS) managing unit) receives an audit informationmessage. The audit information message indicates prior activity within adispersed storage network (DSN) and includes one or more of a type code(e.g., read, write, delete, list, etc.), a short message indicator, along message indicator, a user identifier (ID), an activity timestamp(e.g., a date and time of execution of the activity), an activityindicator, and a source ID. The audit information message may bereceived from one or more of a user device, a dispersed storage (DS)processing unit, a storage integrity processing unit, a DS managingunit, and a DS unit.

The method continues at step 322 where the processing module appends areceived timestamp (e.g., current date and time), a sequence number(e.g., a monotonically and consecutively increasing number), and asource ID (e.g., identifier of machine sending audit informationmessage) to the audit information message to produce an audit record. Astructure of the audit record is discussed in greater detail withreference to FIG. 11B. The method continues at step 324 where theprocessing module caches the audit record in a local memory and/orstores the audit record as encoded audit record slices in a DSN memory.The method continues at step 326 where the processing module determineswhether to process cached audit records. The determination may be basedon one or more of a number of audit records, size of the audit records,and an elapsed time since a last processing. For example, the processingmodule determines to process cached audit records when the number ofaudit records is greater than an audit record threshold. The methodrepeats back to step 320 when the processing module determines not toprocess the cached audit records. The method continues to step 328 whenthe processing module determines to process the cached audit records.

The method continues at step 328 where the processing module transformstwo or more cached audit records to produce an audit object. Thetransforming includes determining a number of audit records of the twoor more audit records to include in the audit object to produce a numberof audit records entry for a number of records field within the auditobject, aggregating the number of audit records into the audit object,generating integrity information, and aggregating the two or more auditrecords, a number of audit records indicator, and the integrityinformation into the audit object in accordance with an audit objectstructure. The audit object structure is discussed in greater detailwith reference to FIG. 11A.

The method continues at step 330 where the processing module dispersedstorage error encodes the audit object to produce one or more sets ofencoded audit slices. The method continues at step 332 where theprocessing module generates a source name corresponding to the one ormore sets of encoded audit slices. For example, the processing modulegenerates the source name based on at least one of an audit vault ID, anaggregator internet protocol (IP) address, and a current timestamp. Themethod continues at step 334 where the processing module outputs the onemore sets of encoded audit slices to a DSN memory utilizing the sourcename.

FIG. 11A is a diagram illustrating an example of an audit object filestructure. The structure includes an audit object data file 336, whereinthe audit object data file 336 may be stored in a dispersed storagenetwork (DSN) as one or more sets of encoded audit slices, and whereinthe audit object data file 336 is accessible at a source name DSNaddress when stored as the one or more sets of encoded audit slices.

The audit object data file 336 includes a number of records field 338, aset of size indicator fields size 1-R, a set of audit record fields 1-R,and an integrity information field 340. The number of records field 338includes a number of records entry indicating a number of audit recordsR included in the audit data object file 336. Each such size indicatorfield includes a size indicator corresponding to an audit record withinthe set of audit records 1-R. For example, a size 1 field includes asize 1 entry of 300 when a size of an audit record entry of audit recordfield 1 is 300 bytes. The integrity information field 340 includes anintegrity information entry, wherein the integrity information entryincludes integrity information corresponding to the audit object datafile. The integrity information is described in greater detail withreference to FIG. 11C.

FIG. 11B is a diagram illustrating an example of an audit record filestructure. The structure includes an audit record data file 342, whereinthe audit record data file 342 may be aggregated into an audit objectdata file 336 for storage in a dispersed storage network (DSN) as one ormore sets of encoded audit slices. The audit record data file 342includes a sourced timestamp field 344, a received timestamp field 346,an object timestamp field 348, a sequence number field 350, a type codefield 352, a source identifier (ID) field 354, a user ID field 356, anda further type information field 358. The sourced timestamp field 344includes a sourced timestamp entry including a date and time of when acorresponding audit message was generated. The received timestamp field346 includes a received timestamp entry including a date and time ofwhen a corresponding audit record was generated. The object timestampfield 348 includes a object timestamp entry including a date and time ofwhen a corresponding audit object data file was generated. The sequencenumber field 350 includes a sequence number entry including amonotonically and consecutively increasing number. The type code field352 includes a type code entry including a type of DSN activity (e.g., aread indicator, a write indicator, a delete indicator, a validtransaction indicator, an invalid transaction indicator). The source IDfield 354 includes a source ID entry indicating an identifier associatedwith a module or unit (e.g., machine) that sent the corresponding auditinformation message. The user ID field 356 includes a user ID entryindicating a user ID associated with the audit information message. Thefurther type information field 358 includes a further type informationentry including one or more of a function of a type code (e.g., a validslice name, an invalid user ID, a valid user ID, an invalid slice name,etc.).

FIG. 11C is a diagram illustrating an example of integrity informationstructure. The structure includes integrity information 360, wherein theintegrity information 360 may be aggregated into an audit object datafile 336 for storage in a dispersed storage network (DSN) as one or moresets of encoded audit slices. The integrity information 360 includes anaggregator identifier (ID) field 362, a certificate chain field 364, asignature algorithm field 366, and a signature field 368. The aggregatorID field 362 includes an aggregator ID of a module or unit thatgenerated the corresponding audit object file. The certificate chainfield 364 includes a certificate chain entry including one or moresigned certificates of a chain structure. The chain structure includesone or more of a signed certificate associated with the aggregator ID,an intermediate signed certificate, and a root signed certificate. Thesignature algorithm field 366 includes a signature algorithm entryindicating one or more of an encryption algorithm identifier associatedwith generating a signature, a public key, and a private key. Thesignature field 368 includes a signature entry indicating a signatureover the entire audit object data file in accordance with a signaturealgorithm of the signature algorithm entry and a public and/or privatekey associated with the aggregator ID.

FIG. 12A is a schematic block diagram of another embodiment of acomputing system that includes a dispersed storage network (DSN) memory22, a dispersed storage (DS) processing unit 16, and a plurality of userdevices 1-U. The DSN memory 22 includes a plurality of DS units 1-4. TheDS processing unit 16 includes a DSN interface 32, a DS processing 34,and a shared database application 370. The DS processing 34 may beimplemented within the DS processing unit 16, within the shared databaseapplication 370, and within a user device 12. The shared databaseapplication 370 includes a software application providing databasefunctionality to the plurality of user devices 1-U and may beimplemented within the DS processing 34, within the DS processing unit16, within a user device 12, or within any computing core 26. The shareddatabase application 370 may operate in accordance with one or moreindustry de facto or de jure standards (e.g., Microsoft SQL 2010). Theplurality of user devices 1-U may access shared (e.g., common) databasedata 371. Each user device of the plurality of user devices 1-U mayutilize a database sharing software client to access the shared databaseapplication 370. The database sharing software client may operate inaccordance with one or more industry de facto or de jure standards(e.g., Sharepoint, Microsoft SQL 2010).

The shared database application 370 utilizes the DS processing 34 tostore and retrieve the database in the DSN memory 22. The shareddatabase application 370 generates a database in accordance with abinary large object (blob) format and produce a blob 372 and sends theblob 372 to the DS processing 34 for storage in the DSN memory 22 asslices 11. The shared database application 370 receives a blob sourcename 374 corresponding to the blob 372 (e.g., a data identifier (ID))from the DS processing 34 such that the DS processing 34 stores the blob372 as encoded blob slices 11 in the DSN memory 22 in accordance withthe blob source name 374. The shared database application 370 locallysaves the data ID and the blob source name 374 to facilitate subsequentretrieval of the blob 372.

In a data storage example of operation, user device 1 sends a datastorage request to the shared database application 370 for storage ofdata 371 in a database. The data storage request includes at least oneof the data 371, a user ID, a group ID, and a data ID. The shareddatabase application 370 generates an amended database based on thedatabase and the data 371 in accordance with a database applicationfunction. For example, the shared database application generates a newdatabase when the data 371 is associated with new data for a newdatabase. As another example, the shared database application 370generates a new portion of an existing database when the data 371 isassociated with new data for an existing database. As yet anotherexample, the shared database application 370 generates an amendedportion of an existing database when the data 371 is associated withmodifying data of an existing database. The shared database applicationperforms a lookup to determine the blob source name 374 based on thedata ID when the shared database application modifies an existingdatabase. The shared database application 370 retrieves an existing blobutilizing the DS processing 34 when the shared database application 370modifies an existing database.

The shared database application 370 sends a new blob storage request tothe DS processing 34 when the shared database application 370 creates anew database. The new blob storage request includes one or more of theblob 372 and a data ID. The shared database application 370 receives ablob source name of 103 corresponding to a data ID of B57 and locallystores the blob source name and data ID when a new database is created(e.g., a new blob is created). The shared database application 370 sendsan existing blob storage request to the DS processing 34 when the shareddatabase application 370 modifies an existing database. The existingblob storage request includes at least one of a modified blob, a dataID, and the blob source name 374.

In a data retrieval example of operation, user device 2 sends a dataretrieval request to the shared database application 370, wherein therequest includes a data ID. The shared database application 370determines the blob source name 374 utilizing the data ID in a lookup.The shared database application 370 sends a blob retrieval request tothe DS processing 34, wherein the request includes a blob source name374. The DS processing 34 retrieves a plurality of sets of encoded blobslices 11 from the DSN memory 22 utilizing the blob source name 374. TheDS processing 34 dispersed storage error decodes the plurality of setsof the blob slices 11 to reproduce the blob 372. The DS processing 34sends the blob 372 to the shared database application. The shareddatabase application extracts data 371 from the blob 372 and sends thedata 371 to user device 2.

FIG. 12B is a flowchart illustrating an example of storing a binarylarge object (blob). The method begins at step 376 where a processingmodule (e.g., of a dispersed storage (DS) processing unit) receives,from a requesting entity, a store binary large object (blob) request.The request may include a blob, a database application identifier (ID),a user ID, a blob source name, a blob size indicator, a priorityindicator, a security indicator, and a performance indicator. Therequesting entity may include one or more of a database engine, adatabase application, a database server, user device, another DSprocessing unit. The blob source name maybe included when acorresponding blob is already stored within a dispersed storage network(DSN) memory (e.g., a modified blob storage sequence). The blob sourcename may not be included when a corresponding blob is not already storedwithin the DSN memory (e.g., a first-time blob storage sequence).

The method continues at step 378 where the processing module determinesa vault pairing corresponding to the blob. The vault pairing includesone or more of a vault ID, a source name, a user ID, and a blob ID. Thedetermination may be based on one or more of the user ID, a port ID, apredetermination, a hard coding, an application pairing, a lookup, amessage, and a command. For example, the processing module determines avault pairing including a vault ID of 457 based on a lookup when a userID of the store blob request is user ID A450.

The method continues at step 380 where the processing module generates ablob source name corresponding to the blob when a source name has notbeen previously assigned to the blob. For example, the processing modulegenerates a blob source name for the blob when a blob source name wasnot received with the store blob request. The determination may be basedon one or more of the vault ID of the vault pairing, a data ID, a blobID, the blob, an object number, a lookup, a predetermination, a sourcename list, and a next source name corresponding to the vault ID. Theprocessing module obtains a blob source name when the source name hasbeen previously assigned to the blob. The obtaining the includes one ormore of receiving the blob source name within the store blob request, aquery, and a lookup.

The method continues at step 382 where the processing module dispersedstorage error encodes the blob to produce a plurality of sets of encodedblob slices. The method continues at step 384 where the processingmodule sends, utilizing the blob source name, the plurality of sets ofencoded blob slices to the DSN memory for storage therein. The methodcontinues at step 386 where the processing module outputs the blobsource name to the requesting entity. Alternatively, or in addition to,the processing module sends a plurality of sets of slice names,corresponding to the blob source name, to the requesting entity.

In an example retrieval process, the method begins with the step wherethe processing module receives a blob source name from a requestingentity. The processing module determines (e.g., a table lookup) a DSNlocation of encoded blob slices based on the blob source name. Theprocessing module retrieves the plurality of sets of encoded blobslices, utilizing the DSN location, from a DSN memory. Next, processingmodule dispersed storage error decodes the plurality of sets of encodedblob slices to reproduce the blob. Next, the processing module sends theblob to the requesting entity.

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. Such an industry-accepted toleranceranges from less than one percent to fifty percent and corresponds to,but is not limited to, component values, integrated circuit processvariations, temperature variations, rise and fall times, and/or thermalnoise. Such relativity between items ranges from a difference of a fewpercent to magnitude differences. As may also be used herein, theterm(s) “operably coupled to”, “coupled to”, and/or “coupling” includesdirect coupling between items and/or indirect coupling between items viaan intervening item (e.g., an item includes, but is not limited to, acomponent, an element, a circuit, and/or a module) where, for indirectcoupling, the intervening item does not modify the information of asignal but may adjust its current level, voltage level, and/or powerlevel. As may further be used herein, inferred coupling (i.e., where oneelement is coupled to another element by inference) includes direct andindirect coupling between two items in the same manner as “coupled to”.As may even further be used herein, the term “operable to” or “operablycoupled to” indicates that an item includes one or more of powerconnections, input(s), output(s), etc., to perform, when activated, oneor more its corresponding functions and may further include inferredcoupling to one or more other items. As may still further be usedherein, the term “associated with”, includes direct and/or indirectcoupling of separate items and/or one item being embedded within anotheritem. As may be used herein, the term “compares favorably”, indicatesthat a comparison between two or more items, signals, etc., provides adesired relationship. For example, when the desired relationship is thatsignal 1 has a greater magnitude than signal 2, a favorable comparisonmay be achieved when the magnitude of signal 1 is greater than that ofsignal 2 or when the magnitude of signal 2 is less than that of signal1.

As may also be used herein, the terms “processing module”, “processingcircuit”, and/or “processing unit” may be a single processing device ora plurality of processing devices. Such a processing device may be amicroprocessor, micro-controller, digital signal processor,microcomputer, central processing unit, field programmable gate array,programmable logic device, state machine, logic circuitry, analogcircuitry, digital circuitry, and/or any device that manipulates signals(analog and/or digital) based on hard coding of the circuitry and/oroperational instructions. The processing module, module, processingcircuit, and/or processing unit may be, or further include, memoryand/or an integrated memory element, which may be a single memorydevice, a plurality of memory devices, and/or embedded circuitry ofanother processing module, module, processing circuit, and/or processingunit. Such a memory device may be a read-only memory, random accessmemory, volatile memory, non-volatile memory, static memory, dynamicmemory, flash memory, cache memory, and/or any device that storesdigital information. Note that if the processing module, module,processing circuit, and/or processing unit includes more than oneprocessing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,and/or processing unit implements one or more of its functions via astate machine, analog circuitry, digital circuitry, and/or logiccircuitry, the memory and/or memory element storing the correspondingoperational instructions may be embedded within, or external to, thecircuitry comprising the state machine, analog circuitry, digitalcircuitry, and/or logic circuitry. Still further note that, the memoryelement may store, and the processing module, module, processingcircuit, and/or processing unit executes, hard coded and/or operationalinstructions corresponding to at least some of the steps and/orfunctions illustrated in one or more of the Figures. Such a memorydevice or memory element can be included in an article of manufacture.

The present invention has been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claimed invention. Further, theboundaries of these functional building blocks have been arbitrarilydefined for convenience of description. Alternate boundaries could bedefined as long as the certain significant functions are appropriatelyperformed. Similarly, flow diagram blocks may also have been arbitrarilydefined herein to illustrate certain significant functionality. To theextent used, the flow diagram block boundaries and sequence could havebeen defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claimed invention. One of average skill in the artwill also recognize that the functional building blocks, and otherillustrative blocks, modules and components herein, can be implementedas illustrated or by discrete components, application specificintegrated circuits, processors executing appropriate software and thelike or any combination thereof.

The present invention may have also been described, at least in part, interms of one or more embodiments. An embodiment of the present inventionis used herein to illustrate the present invention, an aspect thereof, afeature thereof, a concept thereof, and/or an example thereof. Aphysical embodiment of an apparatus, an article of manufacture, amachine, and/or of a process that embodies the present invention mayinclude one or more of the aspects, features, concepts, examples, etc.described with reference to one or more of the embodiments discussedherein. Further, from figure to figure, the embodiments may incorporatethe same or similarly named functions, steps, modules, etc. that may usethe same or different reference numbers and, as such, the functions,steps, modules, etc. may be the same or similar functions, steps,modules, etc. or different ones.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of the various embodimentsof the present invention. A module includes a processing module, afunctional block, hardware, and/or software stored on memory forperforming one or more functions as may be described herein. Note that,if the module is implemented via hardware, the hardware may operateindependently and/or in conjunction software and/or firmware. As usedherein, a module may contain one or more sub-modules, each of which maybe one or more modules.

While particular combinations of various functions and features of thepresent invention have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent invention is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

1. A method for a domain name system (DNS) server, the method comprises:receiving, from a client, a request regarding dispersed storage network(DSN) location information of a hypertext markup language (HTML) file;searching a DNS table for an entry regarding the HTML file based oninformation of the request; and when the entry is found: ascertainingthe DSN location information regarding a plurality of sets of encodeddata slices, wherein the HTML file is encoded using a dispersed storage(DS) error coding function to produce the plurality of sets of encodeddata slices and wherein the plurality of sets of encoded data slices isstored in a DSN; and outputting the DSN location information to theclient.
 2. The method of claim 1 further comprises: the request is aretrieval request that includes at least one of: an identifier of theDSN; a universal record locator (URL) associated with the HTML file; anda source name associated with the plurality of sets of encoded dataslices; and searching the DNS table for the entry based on the at leastone of: the identifier of the DSN, the URL, and the source name.
 3. Themethod of claim 2 further comprises: the retrieval request includes thesource name; and searching the DNS table for the entry based on thesource name.
 4. The method of claim 1, wherein the outputting the DSNlocation information further comprises: determining whether accessingthe HTML file requires authentication; and when accessing the HTML filerequires authentication: outputting, to the client, a DSN internetprotocol (IP) address for a DSN management server; and when anauthentication notice is received, outputting the DSN locationinformation to the client.
 5. The method of claim 1, wherein theoutputting the DSN location information further comprises: determiningwhether accessing the HTML file requires authentication; and whenaccessing the HTML file requires authentication: outputting a DSNauthentication request to a DSN management server based on a DSNinternet protocol address; receiving, from the DSN management server, aDSN authentication response that includes a signed certificate; andoutputting the DSN location information and the signed certificate tothe client.
 6. The method of claim 5 further comprises: storing thesigned certificate for subsequent retrieval requests for the HTML fileby the client.
 7. The method of claim 1 further comprises: when therequest is a creation request to create the entry in the DNS table:creating the entry to include one or more of: an identifier of the DSN;a universal record locator (URL) associated with the HTML file; a sourcename associated with the plurality of sets of encoded data slices; and aDSN internet protocol (IP) address for a DSN management server.
 8. Themethod of claim 1 further comprises: updating the DNS table by one ormore of: accessing a DSN index of the DSN based on a domain name of theDSN to retrieve a plurality of source names that includes the sourcename; and accessing a slice location table utilizing the source name toretrieve a set of DS unit internet protocol addresses.
 9. The method ofclaim 1, wherein the DSN location information comprises at least one of:a set of DS unit internet protocol addresses; a plurality of sets ofslice names associated with the plurality of sets of encoded dataslices; an identifier of the DSN; and a DSN internet protocol (IP)address for a DSN management server.
 10. A dispersed storage (DS) modulecomprises: a first module, when operable within a computing device,causes the computing device to: receive, from a client, a requestregarding dispersed storage network (DSN) location information of ahypertext markup language (HTML) file; a second module, when operablewithin the computing device, causes the computing device to: search adomain name system (DNS) table for an entry regarding the HTML filebased on information of the request; a third module, when operablewithin the computing device, causes the computing device to: when theentry is found, ascertaining the DSN location information regarding aplurality of sets of encoded data slices, wherein the HTML file isencoded using a DS error coding function to produce the plurality ofsets of encoded data slices and wherein the plurality of sets of encodeddata slices is stored in a DSN; and a fourth module, when operablewithin the computing device, causes the computing device to: output theDSN location information to the client.
 11. The DS module of claim 10further comprises: the request is a retrieval request that includes atleast one of: an identifier of the DSN; a universal record locator (URL)associated with the HTML file; and a source name associated with theplurality of sets of encoded data slices; and the second module furtherfunctions to: search the DNS table for the entry based on the at leastone of: the identifier of the DSN, the URL, and the source name.
 12. TheDS module of claim 11 further comprises: the retrieval request includesthe source name; and the second module further functions to: search theDNS table for the entry based on the source name.
 13. The DS module ofclaim 10, wherein the fourth module further functions to output the DSNlocation information by: determining whether accessing the HTML filerequires authentication; and when accessing the HTML file requiresauthentication: outputting, to the client, a DSN internet protocol (IP)address for a DSN management server; and when an authentication noticeis received, outputting the DSN location information to the client. 14.The DS module of claim 10, wherein the fourth module further functionsto output the DSN location information by: determining whether accessingthe HTML file requires authentication; and when accessing the HTML filerequires authentication: outputting a DSN authentication request to aDSN management server based on a DSN internet protocol address;receiving, from the DSN management server, a DSN authentication responsethat includes a signed certificate; and outputting the DSN locationinformation and the signed certificate to the client.
 15. The DS moduleof claim 10 further comprises: a fifth module, when operable within thecomputing device, causes the computing device to: when the request is acreation request to create the entry in the DNS table, create the entryto include one or more of: an identifier of the DSN; a universal recordlocator (URL) associated with the HTML file; a source name associatedwith the plurality of sets of encoded data slices; and a DSN internetprotocol (IP) address for a DSN management server.
 16. The DS module ofclaim 10 further comprises: a sixth module, when operable within thecomputing device, causes the computing device to: update the DNS tableby one or more of: accessing a DSN index of the DSN based on a domainname of the DSN to retrieve a plurality of source names that includesthe source name; and accessing a slice location table utilizing thesource name to retrieve a set of DS unit internet protocol addresses.17. The DS module of claim 10, wherein the DSN location informationcomprises at least one of: a set of DS unit internet protocol addresses;a plurality of sets of slice names associated with the plurality of setsof encoded data slices; an identifier of the DSN; and a DSN internetprotocol (IP) address for a DSN management server.